ArabTAG: a Tree Adjoining Grammar for Arabic Syntactic Structures
نویسندگان
چکیده
In order to construct a generic grammatical resource for Arabic language, we have chosen to develop an Arabic grammar based on TAG formalism. Our choice is, especially, justified by complementarities that we have noticed between Arabic syntax and this grammatical formalism. This paper consists of two comparative studies. The first is between a set of unification grammars. The second is between the characteristics of Arabic language and those of TAG formalism. These comparisons lead us to defend our choice and to describe the structure and characteristics of ArabTAG: a TAG grammatical model for presenting modern Arabic syntactic structures constructed using XML language. ArabTAG will be useful for Arabic processing applications, especially parsing task.
منابع مشابه
Extracting Syntactic Features from a Korean Treebank
In this paper, we present a system which can extract syntactic feature structures from a Korean Treebank (Sejong Treebank) to develop a Feature-based Lexicalized Tree Adjoining Grammars.
متن کاملWhich rules for the robust parsing of spoken utterances with Lexicalized Tree Adjoining Grammars?
In the context of spoken dialogue systems, we investigated a bottom-up robust parsing for LTAG (Lexicalized Tree Adjoining Grammars) that interleaves a syntactic and a semantic structure. When the regular syntactic composition rules fail, the syntactic islands and the corresponding partial semantic structures are combined thanks to additional local rules. We supply some descriptive limits of th...
متن کاملLexical and Syntactic Rules in a Tree Adjoining Grammar
according to this definition 2. Each elementary tree is constrained to have at least one terminal at its frontier which serves as 'head' (or 'anchor'). Sentences of a Tag language are derived from the composition of an S-rooted initial tree with other elementary trees by two operations: substitution (the same operation used by context free grammars) or adjunction, which is more powerful. Taking...
متن کاملWhich rules for the robust parsing of spoken utterances with Lexicalized ' Iree Adjoining Gramn 1 ars ?
In the context of spoken dialogue systems, we investigated a bottom-up robust parsing for LTAG (Lexicalized Tree Adjoining Grammars) that interleaves a syntactic and a semantic structure. When the regular syntactic composition rules fail, the syntactic islands and the corresponding partial semantic structures are combined thanks to additional local rules. We supply some descriptive limits of th...
متن کاملA principle-based hierarchical representation of LTAGs
LTAGs Abstract Lexicalized Tree Adjoining Grammars have proved useful for NLP. However, numerous redundancy problems face LTAGs developers, as highlighted by Vijay-Shanker and Schabes (92). We present a compact hierarchical organization of syntactic descriptions, that is linguistically motivated and a tool that automatically generates the tree families of an LTAG. The tool starts from the synta...
متن کامل